翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

anonymous matching : ウィキペディア英語版
anonymous matching

Anonymous matching is a matchmaking method facilitated by computer databases, in which each user confidentially selects people they are interested in dating and the computer identifies and reports matches to pairs of users who share a mutual attraction. Protocols for anonymous matchmaking date back to the 1980s, and one of the earliest papers on the topic is by Baldwin and Gramlich, published in 1985. From a technical perspective, the problem and solution are trivial and likely predate even this paper. The problem becomes interesting and requires more sophisticated cryptography when the matchmaker (central server) isn't trusted.
The purpose of the protocol is to allow people to initiate romantic relationships while avoiding the risk of embarrassment, awkwardness, and other negative consequences associated with unwanted romantic overtures and rejection. The general concept was patented on September 7, 1999 by David J. Blumberg and DoYouDo chief executive officer Gil S. Sudai, but several websites were already employing the methodology by that date, and thus apparently were allowed to continue using it.〔()〕 United States Patent 5,950,200 points out several potential flaws in traditional courtship and in conventional dating systems in which strangers meet online, promoting anonymous matching of friends and acquaintances as a better alternative:
==Implementations==
Some of the most notable implementations of the idea have been:
*Baldwin and Gramlich, as cited above.
*eCRUSH. launched Valentine's Day, 1999, is the most successful implementation of the concept. Targeted to the teen market, it has more than 1.6 million users and claims more than 600,000 legitimate matches ().
*DoYOU2.com. The website's owner, DoYouDo, Inc., was incorporated 23 September 1999 and acquired by MatchNet in September 2000 in exchange for stock valued at $1,820,000. According to MatchNet's 2003 annual report, "The acquisition was made primarily for the purpose of acquiring the patent on this business model for future development."
*The LiveJournal Secret Crush meme. In mid-2003, a company named Anonymous Consulting created an online quiz called "Secret Crush Meme,"() which would provide each user with a chart showing who on their LiveJournal friends list had a crush on them, as well as what "kind" of crush they had (public, secret or ex). The quiz was designed to harvest crushes between LiveJournal users (hence the elaborate disclaimer). In October 2003, a new quiz, called "Secret Crush Meme 2: The Revenge of Secret Crush Meme," was released (), which showed users how many crushes other users had on them, as well as what kind. There was a catch: For four dollars, the company would tell someone who had crushes on them. This created controversy between couples who listed other users as crushes as well as people getting ex-crushes when they felt they should have gotten public crushes, and much ethics debating. Finally a small PERL script was written and distributed to poison the database. Faced with attempts to poison the database from many different IP addresses, the project was shut down.
*SecretAdmirer.com. This service claims 100,000 successful matches (). Salon.com called SecretAdmirer.com "the grandfather of the concept, launched in 1997." () Its methodology is different from the others in that in order for a match to occur, the recipient must send emails out, rather than simply place names on a confidential list.
These commercial implementations all trust the central server, simplifying the solution and implementation drastically. Baldwin and Gramlich solved this case in 1985, as well as the more notable and challenging case in which the central server isn't trusted.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「anonymous matching」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.